Railway scheduling system using repair-based approach

نویسندگان

  • Te-Wei Chiang
  • Hai-Yen Hau
چکیده

In this paper, we propose an approach for railway scheduling based on iterative repair, a technique that starts with a complete but possibly flawed schedule and searches through the space of possible repairs. Based on the observation that the decision of the track assignments of trains would influence thepe$onnance of the resulting schedule, we divide the scheduling process into two levels. In theJirst level, a route preprocessing algorithm based on local search techniques is developed to find the appropriate track assignments for each train. In the second level, an iterative repair algorithm based on tabu search techniques is applied to repair the flawed schedule. The search is guided by an earliest-conflict-first heuristic that attempts to repair the earliest constraint violation while minimizing the value of objective function. We tested this approach with a randomly generated instance and found that it can work in an effective manner.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cycle detection in repair-based railway scheduling system

In this paper, we propose un approach for railway scheduling based on iterative repair, a technique that starts with a complete but possibly Jawed schedule and searches through the space of possible repairs. The search is guided by an earliest-conflict-jirst heuristic that attempts to repair the earliest constraint violation while minimiring the value of objective finction. Since cycles may exi...

متن کامل

A Comprehensive Approach for Railway Crew Scheduling Problem (Case Study: Iranian Railway Network)

The aim of this study is to propose a comprehensive approach for handling the crew scheduling problem in the railway systems. In this approach, the information of different railway trips are considered as input and the problem is divided to three separated phases. In phase I, we generate all feasible sequences of the trips, which are named as the pairings. A depth-first search algorithm is deve...

متن کامل

A discrete-event optimization framework for mixed-speed train timetabling problem

Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...

متن کامل

Probabilistic Fatigue Life Updating for Railway Bridges Based on Local Inspection and Repair

Railway bridges are exposed to repeated train loads, which may cause fatigue failure. As critical links in a transportation network, railway bridges are expected to survive for a target period of time, but sometimes they fail earlier than expected. To guarantee the target bridge life, bridge maintenance activities such as local inspection and repair should be undertaken properly. However, this ...

متن کامل

Two Mathematical Models for Railway Crew Scheduling Problem

Railway crew scheduling problem is a substantial part of the railway transportation planning, which aims to find the optimal combination of the trip sequences (pairings), and assign them to the crew complements. In this problem, each trip must be covered by at least one pairing. The multiple-covered trips lead to impose useless transfers called “transitions”. In this study, a new ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995